A Complete Axiom System for Isomorphism of Types in Closed Categories

نویسنده

  • Sergei Soloviev
چکیده

It is shown, that ordinary isomorphisms (associativity and commuta-tivity of tensor, isomorphisms for tensor unit and currying) provide a complete axiom system for the isomorphism of types in Symmetric Monoidal Closed categories. This gives also a decision algorithm. The problem originally arises from computer science, as the isomorphism of types in SMC categories corresponds to the isomorphism of types in linear lambda calculus, and could be used for search in databases.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Simple Model Construction for the Calculus of Constructions

We present a model construction for the Calculus of Constructions (CC) where all dependencies are carried out in a set-theoretical setting. The Soundness Theorem is proved and as a consequence of it Strong Normalization for CC is obtained. Some other applications of our model constructions are: showing that CC 4Classical logic is consistent (by constructing a model for it} and showing that the ...

متن کامل

Deciding Isomorphisms of Simple Types in Polynomial Time

The isomorphisms holding in all models of the simply typed lambda calculus with surjective and terminal objects are well studied these models are exactly the Cartesian closed categories. Isomorphism of two simple types in such a model is decidable by reduction to a normal form and comparison under a nite number of permutations (Bruce, Di Cosmo, and Longo 1992). Unfortunately, these normal forms...

متن کامل

On the Unification Problem for Cartesian Closed Categories

Cartesian closed categories (CCC’s) have played and continue to play an important role in the study of the semantics of programming languages. An axiomatization of the isomorphisms which hold in all Cartesian closed categories discovered independently by Soloviev and Bruce and Longo leads to seven equalities. We show that the unification problem for this theory is undecidable, thus settling an ...

متن کامل

Completeness results for metrized rings and lattices

The Boolean ring $B$ of measurable subsets of the unit interval, modulo sets of measure zero, has proper radical ideals (for example, ${0})$ that are closed under the natural metric, but has no prime ideal closed under that metric; hence closed radical ideals are not, in general, intersections of closed prime ideals. Moreover, $B$ is known to be complete in its metric. Togethe...

متن کامل

A Deciding Algorithm for Linear Isomorphism of Types with Complexity O (n log2(n))

It is known, that ordinary isomorphisms (associativity and commutativity of \times", isomorphisms for \times" unit and currying) provide a complete axiomatisation of isomorphism of types in multiplica-tive linear lambda calculus (isomorphism of objects in a free symmetric monoidal closed category). One of the reasons to consider linear isomor-phism of types instead of ordinary isomorphism was t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993